Path extendability of claw-free graphs
نویسندگان
چکیده
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S ∩ {x, y} = ∅, then each (x, y)-path of length less than n − 1 in G is extendable, that is, for any path P joining x and y of length h(<n− 1), there exists a path P ′ in G joining x and y such that V (P ) ⊂ V (P ′) and |P ′| = h+ 1. This generalizes several related results known before. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs
We prove that claw-free graphs, containing an induced dominating path, have a Hamiltonian path, and that 2-connected claw-free graphs, containing an induced doubly dominating cycle or a pair of vertices such that there exist two internally disjoint induced dominating paths connecting them, have a Hamiltonian cycle. As a consequence, we obtain linear time algorithms for both problems if the inpu...
متن کاملLinear Time Algorithms or Hamiltonian Problems on (Claw, Net)-Free Graphs
We prove that claw-free graphs, containing an induced dominating path, have a Hamiltonian path, and that 2-connected claw-free graphs, containing an induced doubly dominating cycle or a pair of vertices such that there exist two internally disjoint induced dominating paths connecting them, have a Hamiltonian cycle. As a consequence, we obtain linear time algorithms for both problems if the inpu...
متن کاملClosure and stable Hamiltonian properties in claw-free graphs
In the class of k-connected claw-free graphs, we study the stability of some hamilto-nian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any of these properties there is an innnite family of graphs G k of arbitrarily high connectivity k such tha...
متن کاملOn some intriguing problems in hamiltonian graph theory--a survey
We survey results and open problems in hamiltonian graph theory centred around three themes: regular graphs, t-tough graphs, and claw-free graphs.
متن کاملThe Path Partition Conjecture is true for claw-free graphs
The detour order of a graph G, denoted by (G), is the order of a longest path in G. The Path Partition Conjecture (PPC) is the following: If G is any graph and (a, b) any pair of positive integers such that (G)= a + b, then the vertex set of G has a partition (A,B) such that (〈A〉) a and (〈B〉) b. We prove that this conjecture is true for the class of claw-free graphs.We also show that to prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006